Even factors with a bounded number of components in iterated line graphs

We consider even factors with a bounded number of components in the n-times iterated line graphs L ⁿ (G). We present a characterization of a simple graph G such that L ⁿ (G) has an even factor with at most k components, based on the existence of a certain type of subgraphs in G. Moreover, we use this result to give some upper bounds for the minimum number of components of even factors in L ⁿ (G) and also show that the minimum number of components of even factors in L ⁿ (G) is stable under the closure operation on a claw-free graph G, which extends some known results. Our results show that it seems to be NP-hard to determine the minimum number of components of even factors of iterated line graphs. We also propose some problems for further research.     

On the criterion vectors of lines of portfolio selection with multiple quadratic and multiple linear objectives

As the research for portfolio selection evolves, traditional models and models with one quadratic objective and multiple linear objectives are being solved. In this paper, I propose models with multiple quadratic and multiple linear objectives. Due to the difficulty involved, I study the new models by lines in decision space, analyze the criterion vectors of the lines by projection, and approximate the nondominated sets by the criterion vectors. As an illustration, I extend Merton’s portfolio selection model, propose algorithms to approximate the nondominated sets by the criterion vectors of portfolios with cardinality 3 and then K, and demonstrate the number of the criterion vectors.     

Study on anti-UV aging mechanism of PP-<Emphasis Type="Italic">g</Emphasis>-AN in the PP/PP-<Emphasis Type="Italic">g</Emphasis>-AN blend

In order to verify the anti-UV aging mechanism about polypropylene-grafting-acrylonitrile (PP-g-AN) to polypropylene (PP), the structural analysis of the PP/PP-g-AN blend before and after aging was carried out via the X-ray photoelectron spectroscopy (XPS), Fourier Transform Infrared Spectrometry (FTIR) and UV-visible Absorbance Spectrum (UV–Vis). Inference on PP-g-AN anti-aging process was proposed and confirmed.     

Stochastic partial functional differential equations with locally monotone coefficients,locally Lipschitz non-linearity and delay

In this paper, we study the existence and uniqueness of strong solutions for stochastic partial functional differential equations with locally monotone coefficients, locally Lipschitz non-linearity, and time delay. Our results extend previous results obtained by Liu–Röckner, Caraballo et al. and Taniguchi et al. Examples are given to illustrate the wide applicability of our results.     

非单C~*-代数α-比较性的等价刻画

给出非单C~*-代数α-比较性的等价刻画:当每个τ∈QT(■H)均为忠实时,■具有α-比较性,当且仅当对于任意的〈a〉,〈b〉∈Cu(■)且∝,若α·d_τ(a)≤在Cu(■)中成立;一般地,当QT(■H)≠Φ时,■具有α-比较性,当且仅当对于任意的,∈Cu(■),若存在η>0,使得d_τ(α)≤(α~(-1)-η)d_τ(b)(_τ∈QT(■H)),则≤在Cu(■)中成立.     

Evaluation of the Hamming weights of a class of linear codes based on Gauss sums

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of q-ary linear codes under some certain conditions, where q is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper can be used in secret sharing schemes, authentication codes and data storage systems.     

Textile porosity determination based on a nonlinear heat and moisture transfer model

The inverse problems of textile materials design on heat and moisture transfer properties are important and indispensable in applications in the body-clothing-environment system. We present an inverse problem of textile porosity determination (IPTPD) based on a nonlinear heat and moisture transfer model. Adopting the idea of the least-squares, the mathematical formulation of IPTPD is deduced to a regularized optimization problem with collocation method applied. The continuity of the regularized minimization problem is proved. By means of genetic algorithm (GA), the approximate solution of the IPTPD is numerically obtained. To reduce the computational cost, an improved algorithm based on BP neural network with GA is proposed in the numerical simulation. Compared with the direct GA searching, the computational cost is greatly reduced, which presents a similar result.     

Hamiltonicity of edge chromatic critical graphs

Vizing conjectured that every edge chromatic critical graph contains a 2-factor. Believing that stronger properties hold for this class of graphs, Luo and Zhao (2013) showed that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{6n}{7}$ is Hamiltonian. Furthermore, Luo et al. (2016) proved that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{4n}{5}$ is Hamiltonian. In this paper, we prove that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{3n}{4}$ is Hamiltonian. Our approach is inspired by the recent development of Kierstead path and Tashkinov tree techniques for multigraphs.     

Exact boundary controllability for 1‐D quasilinear wave equations with dynamical boundary conditions

By equivalently replacing the dynamical boundary condition by a kind of nonlocal boundary conditions, and noting a hidden regularity of solution on the boundary with a dynamical boundary condition, a constructive method with modular structure is used to get the local exact boundary controllability for 1‐D quasilinear wave equations with dynamical boundary conditions. Copyright © 2016 John Wiley & Sons, Ltd.     

TV‐like regularization for backward parabolic problems

This paper investigates an inverse problem for parabolic equations backward in time, which is solved by total‐variation‐like (TV‐like, in abbreviation) regularization method with cost function ∥u_x∥². The existence, uniqueness and stability estimate for the regularization problem are deduced in the linear case. For numerical illustration, the variational adjoint method, which presents a simple method to derive the gradient of the optimization functional, is introduced to reconstruct the unknown initial condition for both linear and nonlinear parabolic equations. The conjugate gradient method is used to iteratively search for the optimal approximation. Numerical results validate the feasibility and effectiveness of the proposed algorithm. Copyright © 2016 John Wiley & Sons, Ltd.